-
1 linear sequential machine
лінійна послідовнісна машинаEnglish-Ukrainian dictionary of microelectronics > linear sequential machine
-
2 machine
- axial lead taping machine
- back-end machine
- bending machine
- bonding machine
- byte machine
- cassette-to-cassette machine
- character machine
- charging machine
- component taping machine
- coordinate plotting machine
- data flow machine
- degrutting machine
- deterministic Turing machine
- deterministic machine
- EBL machine
- finite-state machine
- front-end machine
- generalized sequential machine
- gold dotting machine
- high-реrformance machine
- insertion machine
- ion-beam machine
- lapping machine
- lead-forming machine
- limited register machine
- linear sequential machine
- loading machine
- logic simulation machine
- Mealy machine
- molding machine
- Moor machine
- MOS machine
- multiple step-and-repeat machine
- nondeterministic sequential machine
- photocomposition machine
- pick-and-place machine
- pipelined machine
- planar machine
- plasma-etch machine
- plotting machine
- polishing machine
- powder-coating machine
- projection machine
- reference machine
- scribing machine
- sequencing machine
- single step-and-repeat machine
- software-controlled/ machine
- sorting machine
- stack machine
- step-and-repeat machine
- stuffing machine
- transfer molding machine
- transfer machine
- vector-scan electron-beam machine
- welding machine
- wire-routing machine
- wire-wrap machine
- x-y plotting machine
См. также в других словарях:
Support vector machine — Support vector machines (SVMs) are a set of related supervised learning methods used for classification and regression. Viewing input data as two sets of vectors in an n dimensional space, an SVM will construct a separating hyperplane in that… … Wikipedia
Turing machine equivalents — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Counter machine — A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Pointer machine — In theoretical computer science a pointer machine is an atomistic abstract computational machine model akin to the Random access machine.Depending on the type, a pointer machine may be called a linking automaton, a KU machine, an SMM, an… … Wikipedia
P-complete — In complexity theory, the notion of P complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space. Formally, a decision problem … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Polynomial time — In computational complexity theory, polynomial time refers to the computation time of a problem where the run time, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically using big O notation, this states … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia